Non-Clausal Multi-ary a-Generalized Resolution Calculus for a Finite Lattice-Valued Logic
نویسندگان
چکیده
منابع مشابه
Multi-ary Α-semantic Resolution Automated Reasoning Based on a Lattice-valued Proposition Logic Lp(x)
This paper focuses on multi-ary α-semantic resolution automated reasoning method based on multi-ary α-resolution principle for lattice-valued propositional logic LP(X) with truth-value in lattice implication algebras. The definitions of the multi-ary α-semantic resolution and multi-ary α-semantic resolution deduction in lattice-valued propositional logic LP(X) are given, respectively, and the s...
متن کاملα-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملA Non-clausal Connection Calculus
A non-clausal connection calculus for classical first-order logic is presented that does not require the translation of input formulae into any clausal form. The definition of clauses is generalized, which may now also contain (sub-) matrices. Copying of appropriate (sub-)clauses in a dynamic way, i.e. during the actual proof search, is realized by a generalized extension rule. Thus, the calcul...
متن کاملDetermination of 3-Ary α-Resolution in Lattice-valued Propositional Logic LP(X)
One of key issues for α-n(t) ary resolution automated reasoning based on lattice-valued logic with truthvalue in a lattice implication algebra is to investigate the α-n(t) ary resolution of some generalized literals. In this article, the determination of α-resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundatio...
متن کاملNon-clausal Resolution Theorem Proving for Fuzzy Predicate Logic
The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic of First-Order (FPL) based on the general (non-clausal) resolution rule. There is also presented an unification algorithm handling existentiality without the need of skolemization. Its idea follows from the general resolution with existentiality for the first-order logic. When the prover is constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2018
ISSN: 1875-6883
DOI: 10.2991/ijcis.11.1.29